The local electron affinity for non-minimal basis sets
نویسندگان
چکیده
منابع مشابه
Non-local Minimal Surfaces
In this paper we study the geometric properties, existence, regularity and related issues for a family of surfaces which are boundaries of sets minimizing certain integral norms. These surfaces can be interpreted as a non-infinitesimal version of classical minimal surfaces. Our work is motivated by the structure of interphases that arise in classical phase field models when very long space corr...
متن کاملMinimal non-deletable sets and minimal non-codeletable sets in binary images
The concepts of strongly 8-deletable and strongly 4-deletable sets of 1s in binary images on the 2D Cartesian grid were introduced by Ronse in the mid-1980s to formalize the connectivity preservation conditions that parallel thinning algorithms are required to satisfy. In this paper we call these sets deletable and codeletable, respectively. To establish that a proposed parallel thinning algori...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملSystematically convergent basis sets for transition metals. I. All-electron correlation consistent basis sets for the 3d elements Sc-Zn.
Sequences of basis sets that systematically converge towards the complete basis set (CBS) limit have been developed for the first-row transition metal elements Sc-Zn. Two families of basis sets, nonrelativistic and Douglas-Kroll-Hess (-DK) relativistic, are presented that range in quality from triple-zeta to quintuple-zeta. Separate sets are developed for the description of valence (3d4s) elect...
متن کاملMinimal Separating Sets for
For a Muller automaton only a subset of its states is needed to decide whether a run is accepting or not: The set I the innnitely often visited states can be replaced by the intersection I \ W with a xed set W of states, provided W is large enough to distinguish between accepting and non-accepting loops in the automaton. We call such a subset W a separating set. Whereas the idea was previously ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Molecular Modeling
سال: 2010
ISSN: 1610-2940,0948-5023
DOI: 10.1007/s00894-009-0607-x